Nonuniform fast fourier transforms using min-max interpolation
نویسندگان
چکیده
منابع مشابه
Nonuniform fast Fourier transforms using min-max interpolation
The FFT is used widely in signal processing for efficient computation of the Fourier transform (FT) of finitelength signals over a set of uniformly-spaced frequency locations. However, in many applications, one requires nonuniform sampling in the frequency domain, i.e., a nonuniform FT . Several papers have described fast approximations for the nonuniform FT based on interpolating an oversample...
متن کاملIterative Tomographic Image Reconstruction Using Nonuniform Fast Fourier Transforms
Fourier-based reprojection methods have the potential to reduce the computation time in iterative tomographic image reconstruction. Interpolation errors are a limitation of Fourier-based reprojection methods. We apply a min-max interpolation method for the nonuniform fast Fourier transform (NUFFT) to minimize the interpolation errors. Numerical results show that the min-max NUFFT approach provi...
متن کاملNonuniform sampled scalar diffraction calculation using nonuniform fast Fourier transform.
Scalar diffraction calculations, such as the angular spectrum method (ASM) and Fresnel diffraction, are widely used in the research fields of optics, x rays, electron beams, and ultrasonics. It is possible to accelerate the calculation using fast Fourier transform (FFT); unfortunately, acceleration of the calculation of nonuniform sampled planes is limited due to the property of the FFT that im...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملDimensionless Fast Fourier Transforms
This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2003
ISSN: 1053-587X
DOI: 10.1109/tsp.2002.807005